Co-allocating a reservation spanning different compute resources types

ABSTRACT

A system and method of reserving resources in a compute environment are disclosed. The method embodiment comprises receiving a request for resources within a computer environment, determining at least one completion time associated with at least one resource type required by the request, and reserving resources within the computer environment based on the determine of at least the completion time. A scaled wall clock time on a per resource basis may also be used to determine what resources to reserve. The system may determine whether to perform a start time analysis or a completion time analysis or a hybrid analysis in the process of generating a co-allocation map between a first type of resource and a second type of resource in preparation for reserving resources according to the generated co-allocation map.

CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

The present application is a continuation of U.S. patent applicationSer. No. 14/331,718, filed Jul. 15, 2014, which is a continuation ofU.S. patent application Ser. No. 11/616,156, filed Dec. 26, 2006 (nowU.S. Pat. No. 8,782,654), which is a continuation-in-part of U.S.application Ser. No. 10/530,582, filed Aug. 11, 2006, now U.S. Pat. No.7,971,204, issued Jun. 28, 2011, which claims the benefit of PCTApplication Number: PCT/US05/008297, filed Mar. 11, 2005, which claimspriority to U.S. Provisional Application No. 60/552,653 filed Mar. 13,2004 and U.S. Provisional Application No. 60/603,296 filed Aug. 20,2004, the contents of which are incorporated herein by reference.

RELATED APPLICATIONS

The present application is related to U.S. application Ser. No.10/530,583, now U.S. Pat. No. 7,620,706, U.S. application Ser. No.10/530,581, now U.S. Pat. No. 8,413,155, U.S. application Ser. No.10/530,577 (pending), U.S. application Ser. No. 10/530,576 (pending),U.S. application Ser. No. 10/589,339, now U.S. Pat. No. 7,490,325, U.S.application Ser. No. 10/530,578, now U.S. Pat. No. 8,151,103, U.S.application Ser. No. 10/530,580 (pending) and U.S. application Ser. No.10/530,575, now U.S. Pat. No. 8,108,869. The content of each of thesecases is incorporated herein by reference. If these application numbersare assigned new application numbers associated with these cases thenthe applications associated with the newly assigned application numbersare incorporated herein by reference.

BACKGROUND OF THE DISCLOSURE 1. Field of the Disclosure

The present disclosure relates to reservations of resources within acompute environment such as a cluster or grid and more specifically to asystem and method of providing a co-allocation reservation spanningdifferent resource types based on completion time and/or the relativemachine or resource speed of the resources that are computing submittedjobs.

2. Introduction

There are challenges in the complex process of managing the consumptionof resources within a compute environment such as a grid, compute farmor cluster of computers. Grid computing may be defined as coordinatedresource sharing and problem solving in dynamic, multi-institutionalcollaborations. Many computing projects require much more computationalpower and resources than a single computer may provide. Networkedcomputers with peripheral resources such as printers, scanners, I/Odevices, storage disks, scientific devices and instruments, etc. mayneed to be coordinated and utilized to complete a task. The term computeresource generally refers to computer processors, network bandwidth, andany of these peripheral resources as well. Other resources such aslicense authorization to use software may also be a resource. A computefarm may comprise a plurality of computers coordinated for such purposesof handling Internet traffic. The web search website Google® has acompute farm used to process its network traffic and Internet searches.

Grid/cluster resource management generally describes the process ofidentifying requirements, matching resources to applications, allocatingthose resources, and scheduling and monitoring grid resources over timein order to run grid applications or jobs submitted to the computeenvironment as efficiently as possible. Each project or job will utilizea different set of resources and thus is typically unique. For example,a job may utilize computer processors and disk space, while another jobmay require a large amount of network bandwidth and a particularoperating system. In addition to the challenge of allocating resourcesfor a particular job or a request for resources, administrators alsohave difficulty obtaining a clear understanding of the resourcesavailable, the current status of the compute environment and availableresources, and real-time competing needs of various users. One aspect ofthis process is the ability to reserve resources for a job. A clustermanager will seek to reserve a set of resources to enable the cluster toprocess a job at a promised quality of service.

General background information on clusters and grids may be found inseveral publications. See, e.g., Grid Resource Management, State of theArt and Future Trends, Jarek Nabrzyski, Jennifer M. Schopf, and JanWeglarz, Kluwer Academic Publishers, 2004; and Beowulf Cluster Computingwith Linux, edited by William Gropp, Ewing Lusk, and Thomas Sterling,Massachusetts Institute of Technology, 2003.

The parent case to this application provides details regarding the basiccomputing environment and the context of co-allocating resourcesspanning different resource types. In the parent application,reservations are calculated or reservation ranges are calculated bylooking at when resources become available looking at the wall clocklimit associated with a request and then translating availability rangesinto start ranges by looking at the various times during which at arequest could start and still meet its wall time limit. FIGS. 2A and 2Billustrate a process of analyzing availability ranges of various nodesand then identifying start time ranges associated with when a job or aportion of a job can begin to consume resources. This processing may notfully analyze the compute environment such that full utilization of theresources in the environment is achieved. What is needed is furtherimprovement in the area of analyzing a compute environment toco-allocate resources of different types.

SUMMARY OF THE INVENTION

Additional features and advantages of the disclosure will be set forthin the description which follows, and in part will be obvious from thedescription, or may be learned by practice of the disclosure. Thefeatures and advantages of the disclosure may be realized and obtainedby means of the instruments and combinations particularly pointed out inthe appended claims. These and other features of the present disclosurewill become more fully apparent from the following description andappended claims, or may be learned by the practice of the disclosure asset forth herein. An example software application that can utilize theprinciples set forth below is the Moab® Workload Manager or othersoftware products from Cluster Resources Inc.

The disclosure includes at least a system, method and computer-readablemedia embodiments. The parent application discloses a system and methodembodiment for co-allocating resources within a compute environment. Thecompute environment may be a grid, a cluster or some other grouping ofcompute devices under administrative control of a workload manager. Themethod comprises receiving a request for a reservation for a first typeof resource and analyzing constraints and guarantees associated with thefirst type of resource. A system practicing the disclosure identifies afirst group of resources that meet the request for the first type ofresource and storing the information in a first list, receives a requestfor a reservation for a second type of resource, analyzes constraintsand guarantees associated with the second type of resource andidentifies a second group of resources that meet the request for thesecond type of resource and stores that information in a second list.Finally, the system calculates a co-allocation parameter between thefirst group of resources and the second group of resources and reservesresources according to the calculated co-allocation parameter of thefirst group of resources and the second group of resources. What thatprocess does not do is incorporate information about the speed ofexecution on each of the resources allocated or the completion time foreach portion of a job. Consequently, the information is of value but insome circumstances may not of optimal value.

As noted above, the current practice of calculating reservation rangesby looking at when resources become available, looking at the wall clocklimit associated with a request and translating availability ranges intostart ranges by looking at the various times during which at a requestcould start and still meet its wall time limit is not optimal. Thatanalysis does not incorporate information about the speed of executionon each of the resources allocated. A proposed method to further enhancethe co-allocation of resources comprises receiving a request forresources within a compute environment, determining at least onecompletion time for processing the request within the computeenvironment and reserving resources within the compute environment basedon the determined at least one completion time. One benefit of doingthis approach is to incorporate the availability of the information todetermine a completion time range up front while the system still hasthe current resource information.

Another aspect still uses start time but incorporates the relative speedof each resource to be consumed by the job. Yet another aspect mayinvolve a determination by the system of whether a start time, end timeor hybrid analysis will be more efficient or more appropriate for thejob and/or the compute environment. In this case, the determination maybe a preliminary analysis of the scenario if resources are reserved fora request based on a start time analysis as in the parent case orreserved based on a completion time. The analysis may also be based on ahybrid of both approaches. In either event, some analysis is performedto determine whether reserving the needed resources for consumption byjobs should be done using one of the two approaches or a hybridapproach.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and otheradvantages and features of disclosure the can be obtained, a moreparticular description of the disclosure briefly described above will berendered by reference to specific embodiments thereof which areillustrated in the appended drawings. Understanding that these drawingsdepict only typical embodiments of the disclosure and are not thereforeto be considered to be limiting of its scope, the disclosure will bedescribed and explained with additional specificity and detail throughthe use of the accompanying drawings in which:

FIG. 1 illustrates the maximum time allocated to each node for the job;

FIG. 2A illustrates a per node range analysis;

FIG. 2B illustrates a start time range mapping;

FIG. 2C illustrates a completion time mapping;

FIG. 2D illustrates a wall time mapping;

FIG. 3 illustrates a node with various SMD or MMP contexts;

FIGS. 4A and 4B illustrate method embodiments of the disclosure;

FIG. 5 illustrates another method embodiment of the disclosure; and

FIG. 6 illustrates a system embodiment of the disclosure.

DETAILED DESCRIPTION OF THE DISCLOSURE

Various embodiments of the disclosure are discussed in detail below.While specific implementations are discussed, it should be understoodthat this is done for illustration purposes only. A person skilled inthe relevant art will recognize that other components and configurationsmay be used without parting from the spirit and scope of the disclosure.

The “system” embodiment of the disclosure may comprise a computingdevice that includes the necessary hardware and software components toenable a workload manager or a software module to perform the steps ofthe disclosure. As noted above, software such as Cluster Resources'Moab® Workload Manager or other Moab® branded software may utilize theprinciples herein. Such a computing device, shown by way of example inFIG. 6, may include such known hardware elements as one or more centralprocessors, random access memory (RAM), read-only memory (ROM), storagedevices such as hard disks, communication means such as a modem or anEthernet card to enable networking with other computing devices, a busthat provides data transmission between various hardware components, akeyboard, a display, an operating system and so forth. There is norestriction that the particular system embodiment of the disclosure hasany specific hardware components and any known or future developedhardware configurations are contemplated as within the scope of thedisclosure when the computing device operates as is claimed. The computeenvironment such as a cluster or grid with its workload managedaccording to these principles may also be an embodiment. A moduleperforming any particular function may include software controlling oneor more hardware components.

The parent application incorporated herein by reference includes detailsregarding submitting jobs to a compute environment and the basicprocesses involved in workload management for a cluster or gridenvironment as well as the co-allocation process based on start times.Accordingly, the present application will discuss the subject matter ofthis application. A “resource” that is represented, by way of example,may be a processor, data storage, RAM, communication bandwidth, licenseauthority, and so forth. Thereafter, a requester may submit a requestfor resources to run a “job” that will consume those resources.

An aspect of the present disclosure is to change the method by which thesystem evaluates requests for resources whereby the list of resourcesthat are being evaluated for allocation will also be evaluated to lookat the relative scalability or speed on a per request basis. This meansthat the system does not just look at an absolute value or attribute ofthe node or resource, but also looks at the effectiveness of thatrespective node or resource in satisfying a workload request of asimilar nature to the one currently being processed. Once the system hasthat information, the system can look at the worst case scalability orexecution time for that request, plus all the different types ofresources that are being considered. Once the system has that effectiveminimum scalability or speed associated with the consumption of theseresources, the system can then not only incorporate the wall clock limitin determining the range of execution, but the system can actually alsoincorporate the speed factor to determine how long the job would run andwhat the scaled wall clock limit would be. Consequently, once the systemis aware of the scaled wall clock limit, the system determines what thecompletion times are and then returns a range of completion timesopposed to a range of start times.

The present disclosure provides for modifications of advancedreservation range selection determining the timeframe and the resourceset on which a particular request, such as a multi-resource request, canbe executed. In previous efforts, this was accomplished by determining aset of available ranges when resources were actually available for usageand then converting those into an aggregate range of availabletimeframes representing times in which the job could actually start andbe guaranteed to have adequate resources for completion. Herein, thatalgorithm is modified such that the system incorporates completion timerather than availability time. A hybrid approach may also be applied.The main benefit of this approach is that the system analyzes multiplesets of resources and their associated requirement and determines atimeframe which they could all complete which would incorporate scalinginformation or variable heterogenesis resource capability informationthat is per job specific.

FIG. 1 illustrates an example request or job with a wall clock timerequirement, in this case, of 240 units or seconds. A job submitted toconsume resources in a compute environment will only run as fast as theslowest system. FIG. 1 illustrates various nodes N.sub.1, N.sub.2,N.sub.3, N.sub.4 and relative times to the wall clock limit. The slowestresource is represented as a 1.0 which means it will process the requestin 240 units of time. The first step in this process is, in response toa request for resources, the system analyzes resources that can befeasibly matched to the request. The system may also look for feasibleresources that with no workload could potentially satisfy the request.Once the system has established its list of resources (in this caseN.sub.1-N.sub.4 have been selected from a greater set of resources), itthen analyzes each of those resources to determine their effective speedor capability of executing the compute aspects or fulfilling therequirements of the request J.sub.1. As shown in FIG. 1, node 1 has arelative speed component of 1.0. Node 2 can process J.sub.1 faster andso has a speed of 1.5. A speed of 1.5 is calculated by dividing 240 by1.5 to arrive at 160, which means that N.sub.2 could process that job in160 units of time rather than 240 units. N.sub.3 has a speed of 1.2 andnode N.sub.4 has a speed of 1.0. Each of these entries thus indicatesthe capability of individual nodes of processing the request J.sub.1.These times may represent nodes or some other resource or grouping ofresources. For example, it may be a cluster of resources and its speedrelative to other clusters in a grid. These values in FIG. 1 represent adivision of the wall clock speed to determine an effective duration.

The availability ranges relate to when the resources are not beingconsumed or dedicated to anything else. FIG. 2A illustrates availabilityranges 102, 104, 106, 108, 110, 112, 114, 116, 118 and 120 on a per nodebasis. These may represent, for example, processor availability on thesenodes over time. In this example, there are four nodes. Job J.sub.1 isshown by way of example. In the prior application, the system wouldsimple collapse all these available ranges into a cumulativeavailability range (shown in FIG. 2B herein and FIG. 2B of the parentcase). Note the correlation between the timing of available ranges inFIG. 2A with the start time ranges shown in FIG. 2B. These are per noderanges and represent a cumulative available range.

Pre-filtering may occur with the available range shown in FIG. 2B toremove items such as shorter ranges 118 that are not long enough toinsure that enough resources are available for the full wall clock limitrepresented for J.sub.1. Therefore, this pre-filtering would performsuch tasks as eliminating parts of the range that should not be includedin the analysis such as range 118. (FIGS. 2B and 2C do not show anyfiltering of the ranges of FIG. 2A)

We turn temporarily to a discussion of FIG. 3. FIG. 3 illustrates asingle node 302 with several features. This node is treated as acluster. Thus within this cluster there may also be nodes. In one aspectof the disclosure, there is a different approach for symmetric multiprocessing (SMP) and massively multi-processing (MMP). If there are SMPsthen the system preferably does not filter as discussed above. SMP meansthat certain resources or nodes are all on the same machine and thesystem can actually transparently migrate an application that is runningone place to another “under the covers.” If the context is distributedor an MMP context, then the system preferably filters on a per job basisor according to the wall clock limit upfront. When the processingremains on the same machine as in SMP then there may be, by way ofexample, four different nodes on the same machine 304 as shown in FIG.3. FIG. 3 also shows where a single node represents a cluster 302 as agrouping 304 that has four products or could, in the MMP context, havefour nodes 306A, 306B, 306C and 306D that each has one product. In theMMP scenario, the system collapses the time ranges and then continues toprocess, and may or may not filter. If the context is SMP, then thesystem preferably filters then collapses. The basic point here is thatthe system may modify whether or not to filter and what order to filterand collapse based on whether the approach is associated with SMP orMMP.

As introduced above, an aspect of the disclosure is to look atcompletion time ranges. FIG. 2B illustrates the cumulative availablestart ranges of the approach in the parent case. For example, blockedout areas 200, 202, 204, 206 and 208 represent areas that areunavailable because jobs cannot start during those periods. Since jobsrequire time to complete, they cannot start too near the end of theavailable range. The scaled wall clock times shown in FIG. 1 may or maynot be used to block out these regions. The system looks at how long thejob needs and its completion range. Because the system analyzescompletion time ranges it can merge this information with another systemthat has a different wall clock limit and can do an analysis thatautomatically incorporates this capability and returns the effectiveco-allocation completion range.

FIG. 2B illustrates incorporating execution time into start time rangesfor the purpose of co-allocation either across time or across space.Blocks 200, 202 and 204 each show a space that is blocked out, whichrepresents space that is associated with an availability range but notassociated with a start range. The process of translating anavailability range over to a start range is basically the process ofsubtracting the wall clock time of the task off of the end of thatrange. The range consists of a start time and an end time, first as anavailability range. When it is translated over to a start time itbecomes a range from start time to end time minus the wall time. Thiseffectively lets the system know when a job can start and completeinside that availability range. An important point to note is that eachrange, as it is evaluating a different resource or a different rack,could potentially have a different wall time; it is dependent upon theamount of time that particular task requires to execute. That can bebased on two different factors. One, inherently the task itself takes adifferent amount of time. One task may be more complicated than another.Or if the system is allocating multiple resources to a singlerequirement then the amount of wall time can be changed or varied basedon the effective speed of the resource that is computing that task. Forexample, if one has a job that requires one hour and on a processor thatexecutes at a speed with a relative speed factor of 1.0, then if thesystem were to run that same task on a machine that had a speed with afactor of 2.0 then it would be able to complete in half that time, or in30 minutes. In another scenario, if it ran on a machine with aneffective relative speed of 0.5 it would run in a period of 2 hours. Ifthe algorithm associated with generating start time ranges properlyincorporates the effective wall time of that task on that resource thenthe system can automatically inherit or incorporate that machine's speedinformation into the mathematics of range analysis and co-allocationdefault.

Therefore, an aspect of the disclosure is to take the wall clock intoaccount in the modified co-allocation mapping. The modifiedco-allocation mapping properly reflects the relative machine speed ofthe resources that would be computing the tasks. The end result is thatreservations will guarantee that each allocated computer resource cancomplete that task taking into account its relative speed. A secondbenefit of this approach based on when co-allocating multiple processingrequirements at the same time, one requirement may take less time thananother. The system can determine when to start each of these and stillallow them all to complete at the same time. In fact, the system canalso mix and match both at the same time in a single task that requiresmultiple computer resources at variable speed and mix that with multipletasks that inherently require different amounts of speed.

So ultimately when the system makes the reservation, and then whenworkload consumes the resources, the workload manager can squeeze moreutilization out of the resources in the compute environment. Thisapproach improves the utilization because the workload manager can do abetter job of finding more holes or more locations which the task cancomplete successfully both in space and time. An alternative approachcould be to base the analysis off the completion time range as opposedto start time range simply by inverting the logic. However, it may notmatter if it is the start time range or the end time range. The systemstill needs to use the same procedure taking into account the relativewall time of each individual task on a per resource basis to determinewhen and where to make the optimal reservation.

If the system uses the completion time range, it can then launch tasksscattered about multiple resources such that all tasks complete at thesame time as opposed to start at the same time. Both methodologies(start time and completion time) will make certain resources areavailable for an adequate duration to allow jobs to execute, but in acompletion time range the system makes certain that all tasks completeat the same instant. FIG. 2D illustrates the benefit of using thecompletion time analysis. Row 230 is shown having a start time S1 and anend time at E1. The wall time is not taken into account. The resourceswhich would be required or reserved to process that job will be reservedfor the entire time from S1 to E1. However, under a completion timeanalysis, once the completion time range has been determined or apotential target time has been reached, in which the system knows thatall the tasks can complete and all the resources are available in bothspace and time and that decision has been logged, the system can thenmake a determination on exactly when to actually start the task. Thusthe new start time for the task is represented on row 232 in which a newstart time S2 is shown, which represents the end time El minus the walltime 234. The time between S1 and S2 is shown as time 236 whichrepresents time or resources which may be saved or used for other jobs.If this analysis is done for each variable task associated with arequest for resources, then the system will vary the actual start timesfor these tasks simply by subtracting the effective execution time offof each resource.

A determination may be made by the system regarding whether to use astart time analysis or completion time analysis. For example, a job maybe better suited to end at the same time with its various tasks becauseof its date retrieved and storage requirements. Other jobs may need tostart all their tasks at the same time while others may be agnostic tosuch a requirement. Thus, an analysis of the job, the computeenvironments user credentials, and/or other factors may be involved inselecting a start time or end time or hybrid analysis. User credentialsmay force the system to select the start or end time in favor of theuse's job if there is a conflict between the benefit to the user versusthe configuration or maximum utilization of the compute environment.

The system may also alternate or mix and match a start time andcompletion time analysis. They are both useful in different types oftasks. An important value for completion time is being able to completeand simply being able to find a place where all the resources areavailable. Some tasks are better situated to take advantage of allstarting at the same time which indicates that a start range may bebetter. Other tasks are best if they are all processing off the sameinput data then the input data record won't be available till a certaintime. Then the start time range may be selected if they both need togenerate the results and the system is limited on the amount of diskspace available, and then the user may want a completion time range sothey all transmit the final data at the same time.

As mentioned above, an aspect of the disclosure is that part of theintelligence includes a selection component for selecting between usinga start time or a completion time in the co-allocation analysis. Amanual input option may be provided for a user to input preferred orhis/her own analysis or labeling of what type of computation to perform.For example, a start time would minimize the amount of prerequisiteresources being required because they will be consumed all at the verybeginning and you can free up those resources as soon as they have allbeen picked up by the task. The completion time may be selected if theend result is the biggest consumer resource and the system wants it allavailable at the same moment so it can be transmitted or stored. Theanalysis may thus include a just-in-time start and/or a just-in-timeend. The decision on whether to co-allocate based on start or completetime or a hybrid of the two may be based on at least one of the job, theresources, user selection, user payment, status of the computeenvironment, user credentials, or any other mix of factors.

In a hybrid approach, the system may first determine whether anexclusive approach based on either start time or completion time isoptimal. This analysis may be based on one or more factors such ascompute environment optimization, user credentials, components of thejob (data needs, processor needs, timing needs for data retrieval,writing and processing, etc.), licensing or other administrative needsor requirements, etc. If the analysis yields a result to just use starttime or completion time, then the system proceeds to reserve resourcesand then run the job in the compute environment. If the analysis yieldsa result that is a hybrid, then the system may utilize a start timeanalysis for some aspect of the job and completion time for another.This may be done using two separate analyses and separately reservingresources for different aspects of the job or in any other fashion. Thenthe resources are reserved and the system will then process the jobaccordingly. The scaled wall clock data is inherently used in theseprocesses to improve system performance but it is not necessary.

The system may automatically configure such analysis and selection. Thesystem may dynamically decide based on which resources are mostconstrained. It could be configured by administrator to be selected on aper job basis. It could be selected according to a user profile, itcould be selected based on historical learned information that theschedule of the system. Further, users may pay for this kind ofoptimization once, on a per job or per request basis, or in some othermanner.

The next step, once the system actually determines the relative speedand the system has selected nodes that are feasible or available, thenthe system analyzes other commitments that have already been made for bythese resources for other workload or other purposes. This isrepresented for node N.sub.1 by FIGS. 102, 106 and 108 representing thatat those particular timeframes in which the block appear, thoseresources are available for executing some component of J.sub.1. Thisdoes not necessarily mean that it can complete J.sub.1, it simply saysit is available. N.sub.2 is evaluated and it is shown that the timeframerepresented by 104, 110 and 112 are available so on down through N.sub.3and N.sub.4. These constitute per node availability ranges. The currentmodel is based on availability ranges or start time ranges, with anaggregate or summary of the resource availability over time to generatethe graph which is represented in FIG. 2B. Next, the system looks at thetimeframe at which a job could potentially start and the systemeliminates the spaces that are represented by 200, 202, 204, 206 and208. So those indicate times that are not available for the applicationto actually start.

The approach of FIG. 2B, while showing when jobs can start, does notincorporate relative speeds into the resulting range graph. In oneaspect, instead of translating the ranges of FIG. 2A into anavailability range, the system translates it into a potential completedof time range as shown in FIG. 2C. This represents when the applicationor job could potentially complete. The timeframes which are not eligibleare 216, 218, 220, 222, 224, 226. These are timeframes which theparticular job cannot start because of the time it requires to consumethe resources. Once the system has that information regarding when thejob can complete, the system can then do a merger with anotherrequirement or another test and determine a co-allocation request ofmulti-resource types or multiple collections of resources. For adifferent resource or other parameters, such a merger will represent thetimeframes in which those jobs can complete even if those jobs or thoseresources have varying scalability factors or varying speed factors.This information is now incorporated and this resulting information canbe used to map out when resources are actually available and can bemerged together. Once they are merged together, final co-allocationranges are established. That information can be extracted back out andresulting start times may be determined inversely by re-establishing thescaled wall clock limit. The system can determine the associated starttime requirements for each individual requirement that went in to beconsidered. A reservation of the appropriate resources can be made andthen those reserved resources can be consumed and process the job.

Scalability in this context relates to the speed or how well eachindividual resource scales its speed factor for the particular requestof interest. So with this approach, not only can one have multiple racksof nodes or processes that each run at a different rate on the same setof resources, one can also have multiple racks that run at differentrates on different sets of resources. Once the system establishes thestart points that it is interested in, because it knows the scalability,it can reverse calculate the start times that are required to obtainthat position.

The available range of start times calculated based on knowledge of endtimes are shaded in FIG. 2C graph 212. The system looks for a time framein which all the requirements on all the resources can be satisfied onthe same time. Once the system knows that it has an overlap and becausethe system knows when a job will complete, how fast it will run and atwhat speed, the system then calculates the start time or start timerange available that is required to execute the job or request.

In practice, the start time for various calculations will likely startat the same time. Some of them will complete a little bit earlier,others will compete on the expected deadline. But all or most will allbe complete and because the system is also looking at the worse casescenario of all the resources, the system guarantees that everythingwill fit inside that space 212.

In the scenario of the parent application, in the analysis, jobs wouldstart at the appropriate time, but some might end after the allocatedavailability time. In that case, it was more difficult to properly mergethem. This is because to properly merge them would require mapping ofeverything to the worse case superset. So, the worst possible rack onthe worst possible node. However, the approach of the present disclosuredoes not strain the analysis in that way.

FIG. 4A illustrates a method embodiment of the disclosure. A preferredembodiment relates to reserving resources in a compute environmentaccording to a method comprising receiving a request for resourceswithin a compute environment (402), determining at least one completiontime associated with at least one resource type required by the request(404) and reserving resources within the compute environment based onthe determined at least one completion time (406). Another embodiment isshown in FIG. 4B which shows receiving a request for resources within acompute environment (410), determining at least one relative resourcespeed associated with processing at least a portion of the request on arespective resource machine (412) and reserving resources within thecompute environment based on the determined at least one resource speed(414).

The method aspect of the disclosure may further comprise determining arange of completion times for the request. The step of determining theat least one completion time may at least in part be based on wall clockscaling information that is job specific. A system practicing thedisclosure may further identify feasible resources within the computeenvironment for the request or analyze each identified feasible resourcefor its effective speed in fulfilling the request. For example, thevarious resources in a compute environment, processors, hard drives,communications bandwidth, etc., may each be analyzed for its respectiveeffective speech in fulfilling the request such that the effective speedor relative resource speed may be utilized when making reservationdecisions that are more efficient and more effective in maximizingefficiency within the compute environment. The method may furthercomprise analyzing workload commitment for each identified feasibleresource, wherein the analysis of workload commitments represents a pernode or resource availability range. The per node or resourceavailability range may be translated into a potential completion timerange. Follow on steps may involve merging the potential completion timerange with at least one other requirement and determining aco-allocation for multiple collections of resources that can meet therequest. Such a merging may represent a merging of at least two mappingsof potential completion times for diverse resources in the computeenvironment.

The method above may also further comprise determining at least onestart time associated with the request using a scaled wall clock limitfor the request. The at least one completion time for the request may bedetermined based on a worst case scenario for any particular resource.For example, if a bandwidth range is 100 MB-1000 MB, the system may makeits determination based on a bandwidth of 100 MB. It may also performfurther analysis on the resource and make its determination based on oneor more other factors such as average resource performance or predictedperformance based on other factors such as time of day or user historyhaving the resource reserved.

FIG. 5 illustrates another example method embodiment and shows a methodof co-allocating resources within a compute environment. The methodcomprises receiving a request for resources requiring a first type ofresource and a second type of resources (502), analyzing completiontimes associated with the first type of resource (504), analyzingcompletion times associated with the second type of resource (506),generating a co-allocation map between the first type of resources andthe second type of resources based on the analysis of completion timesfor the first and second type of resource (508) and reserving resourcesaccording to the generated co-allocation map (510). Generating theco-allocation map may comprise identifying a reduced map of quantitiesof resources that can simultaneously satisfy the first request and thesecond request. The co-allocation map may comprise all time frames whereavailable resources exist that satisfy the first request and the secondrequest. In this process, the possible types of resources may consist ofat least one of: compute resources, disk storage resources, networkbandwidth resources, memory resources, licensing resources, userpreferences and user data.

Generating the co-allocation map may further comprise identifying anintersection of the availability of each of the first type of resourceand the second type of resource. This may involve generating theco-allocation map by determining intersecting time frames in which boththe first request and the second request may be simultaneously satisfiedand generating a resulting array of events describing the intersectingtime frames. The resulting array of events may comprise at least one ofresource quantity, resource quality, time frames, quality of informationand cost.

As with the embodiment of FIGS. 4A and 4B, the embodiment shown in FIG.5 may be based not on completion time but on at least one relativeresource speed required to process at least a portion of a request.Thus, this relative or effective resource speed may be analyzed for atleast one resource within the compute environment and a co-allocationmap may be generated based on the resource speeds for the first andsecond type of resource. This effective speed usage may then be appliedindependently or in connection with the completion time to generate theco-allocation maps. Also as discussed above, whether start times orcompletion times will be used in the co-allocation analysis may also beapplied in connection with knowledge of the relative or effectiveresource speed such that the co-allocation request may be optimized forthe request for resources. These various methods may also include ananalysis or determination of whether a hybrid approach may be utilizedto further improve the co-allocation request to maximize use ofresources. Such an analysis may further be weighted to favor maximum useof resources, favor job performance, user performance, user convenienceor any other balancing of interests in performing the analysis andpreparation for reserving resources for the co-allocation request.

With reference to FIG. 6, an exemplary system for implementing thedisclosure includes a general-purpose computing device 600, including aprocessing unit (CPU) 620 and a system but 610 that couples varioussystem components including the system memory such as read only memory(ROM) 640 and random access memory (RAM) 650 to the processing unit 620.Other system memory 630 may be available for use as well. It can beappreciated that the disclosure may operate on a computing device withmore than one CPU 620 or on a group, cluster or grid of networkedcomputing devices to provide greater processing capability. The systembut 610 may be any of several types of bus structures including a memorybus or memory controller, a peripheral bus, and a local bus using any ofa variety of bus architectures. A basic input/output (BIOS), containingthe basic routine that helps to transfer information between elementswithin the computing device 600, such as during start-up, is typicallystored in ROM 640. The computing device 600 further includes storagemeans such as a hard disk drive 660, a magnetic disk drive, an opticaldisk drive, tape drive or the like. The storage device 660 is connectedto the system bus 610 by a drive interface. The drives and theassociated computer readable media provide nonvolatile storage ofcomputer readable instructions, data structures, program modules andother data for the computing device 600. The basic components are knownto those of skill in the art and appropriate variations are contemplateddepending on the type of device, such as whether the device is a small,handheld computing device, a desktop computer, or a computer server.

Although the exemplary environment described herein employs the harddisk, it should be appreciated by those skilled in the art that othertypes of computer readable media which can store data that areaccessible by a computer, such as magnetic cassettes, flash memorycards, digital versatile disks, cartridges, random access memories(RAMs), read only memory (ROM), a cable or wireless signal containing abitstream and the like, may also be used in the exemplary operatingenvironment.

To enable user interaction with the computing device 600, an inputdevice 690 represents any number of input mechanisms, such as amicrophone for speech, a touch-sensitive screen for gesture or graphicalinput, keyboard, mouse, motion input, speech and so forth. The deviceoutput 670 can also be one or more of a number of output means. In someinstances, multimodal systems enable a user to provide multiple types ofinput to communicate with the computing device 600. The communicationsinterface 680 generally governs and manages the user input and systemoutput. There is no restriction on the disclosure operating on anyparticular hardware arrangement and therefore the basic features heremay easily be substituted for improved hardware or firmware arrangementsas they are developed.

Embodiments within the scope of the present disclosure may also includecomputer-readable media for carrying or having computer-executableinstructions or data structures stored thereon. Such computer-readablemedia can be any available media that can be accessed by a generalpurpose or special purpose computer. By way of example, and notlimitation, such computer-readable media can comprise RAM, ROM, EEPROM,CD-ROM or other optical disk storage, magnetic disk storage or othermagnetic storage devices, or any other medium which can be used to carryor store desired program code means in the form of computer-executableinstructions or data structures. When information is transferred orprovided over a network or another communications connection (eitherhardwired, wireless, or combination thereof) to a computer, the computerproperly views the connection as a computer-readable medium. Thus, anysuch connection is properly termed a computer-readable medium.Combinations of the above should also be included within the scope ofthe computer-readable media.

Computer-executable instructions include, for example, instructions anddata which cause a general purpose computer, special purpose computer,or special purpose processing device to perform a certain function orgroup of functions. Computer-executable instructions also includeprogram modules that are executed by computers in stand-alone or networkenvironments. Generally, program modules include routines, programs,objects, components, and data structures, etc. that perform particulartasks or implement particular abstract data types. Computer-executableinstructions, associated data structures, and program modules representexamples of the program code means for executing steps of the methodsdisclosed herein. The particular sequence of such executableinstructions or associated data structures represents examples ofcorresponding acts for implementing the functions described in suchsteps.

Those of skill in the art will appreciate that other embodiments of thedisclosure may be practiced in network computing environments with manytypes of computer system configurations, including personal computers,hand-held devices, multi-processor systems, microprocessor-based orprogrammable consumer electronics, network PCs, minicomputers, mainframecomputers, and the like. Embodiments may also be practiced indistributed computing environments where tasks are performed by localand remote processing devices that are linked (either by hardwiredlinks, wireless links, or by a combination thereof) through acommunications network. In a distributed computing environment, programmodules may be located in both local and remote memory storage devices.

Although the above description may contain specific details, they shouldnot be construed as limiting the claims in any way. Other configurationsof the described embodiments of the disclosure are part of the scope ofthis disclosure. Accordingly, the appended claims and their legalequivalents should only define the disclosure, rather than any specificexamples given.

What is claimed is:
 1. A method comprising: receiving a workload requestfor resources within a network of computers, wherein the workloadrequest requires a first type of resource and a second type of resource,wherein the second type of resource is of a different type of resourcefrom the first type of resource; determining a first completion timeassociated with the first type of resource; determining a secondcompletion time associated with the second type of resource; generatinga co-allocation map for multiple collections of resources that can meetthe workload request based on the determinations; and reservingresources of the first type of resource and the second type of resourcewithin the network based on the co-allocation map.
 2. The method ofclaim 1, wherein determining the first completion time and the secondcompletion time is at least in part based on scaling informationspecific to the workload request.
 3. The method of claim 1, furthercomprising: analyzing a workload commitment for the first type ofresource and the second type of resource.
 4. The method of claim 3,wherein the analyzing results in a per node availability range.
 5. Themethod of claim 1, further comprising: merging at least two mappings ofpotential completion time ranges for diverse resources in the computeenvironment.
 6. The method of claim 1, further comprising: determiningat least one start time associated with the workload request using ascaled wall clock limit for the workload request.
 7. The method of claim1, wherein the first completion time and the second completion time forthe workload request are determined based on a worst case scenario forany particular resource.
 8. A system comprising: a processor; and acomputer-readable storage medium storing instructions, which, whenexecuted by the processor, cause the processor to perform operationscomprising: receiving a workload request for resources within a networkof computers, wherein the workload request requires a first type ofresource and a second type of resource, wherein the second type ofresource is of a different type of resource from the first type ofresource; determining a first completion time associated with the firsttype of resource; determining a second completion time associated withthe second type of resource; generating a co-allocation map for multiplecollections of resources that can meet the workload request based on thedeterminations; and reserving resources of the first type of resourceand the second type of resource within the network based on theco-allocation map.
 9. The system of claim 8, wherein thecomputer-readable storage medium further comprises instructions, which,when executed by the processor, perform further operations comprising:determining the first completion time and the second completion time isat least in part based on scaling information specific to the workloadrequest.
 10. The system of claim 8, wherein the computer-readablestorage medium further comprises instructions, which, when executed bythe processor, perform further operations comprising: analyzing aworkload commitment for the first type of resource and the second typeof resource.
 11. The system of claim 10, wherein the analyzing resultsin a per node availability range.
 12. The system of claim 8, wherein thecomputer-readable storage medium further comprises instructions, which,when executed by the processor, perform a method comprising: merging atleast two mappings of potential completion time ranges for diverseresources in the compute environment.
 13. The system of claim 8, whereinthe computer-readable storage medium further comprises instructions,which, when executed by the processor, perform a method comprising:determining at least one start time associated with the workload requestusing a scaled wall clock limit for the workload request.
 14. The systemof claim 8, wherein the first completion time and the second completiontime for the workload request are determined based on a worst casescenario for any particular resource.
 15. A non-transitorycomputer-readable storage medium storing instructions which, whenexecuted by a processor, cause the processor to perform operationscomprising: receiving a workload request for resources within a networkof computers, wherein the workload request requires a first type ofresource and a second type of resource, wherein the second type ofresource is of a different type of resource from the first type ofresource; determining a first completion time associated with the firsttype of resource; determining a second completion time associated withthe second type of resource; generating a co-allocation map for multiplecollections of resources that can meet the workload request based on thedeterminations; and reserving resources of the first type of resourceand the second type of resource within the network based on theco-allocation map.
 16. The non-transitory computer-readable storagemedium of claim 15, wherein determining the first completion time andthe second completion time is at least in part based on scalinginformation specific to the workload request.
 17. The non-transitorycomputer-readable storage medium of claim 15, further comprising:analyzing a workload commitment for the first type of resource and thesecond type of resource.
 18. The non-transitory computer-readablestorage medium of claim 17, wherein the analyzing results in a per nodeavailability range.
 19. The non-transitory computer-readable storagemedium of claim 15, further comprising: merging at least two mappings ofpotential completion time ranges for diverse resources in the computeenvironment.
 20. The non-transitory computer-readable storage medium ofclaim 15, further comprising: determining at least one start timeassociated with the workload request using a scaled wall clock limit forthe workload request.